Search Results

Documents authored by Kuo, Frances Y.


Found 2 Possible Name Variants:

Kuo, Frances Y.

Document
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 19341)

Authors: Dmitriy Bilyk, Aicke Hinrichs, Frances Y. Kuo, and Klaus Ritter

Published in: Dagstuhl Reports, Volume 9, Issue 8 (2020)


Abstract
From 18.08. to 23.08.2019, the Dagstuhl Seminar 19341 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (LZI), Schloss Dagstuhl. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar can be found in this report. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Dmitriy Bilyk, Aicke Hinrichs, Frances Y. Kuo, and Klaus Ritter. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 19341). In Dagstuhl Reports, Volume 9, Issue 8, pp. 26-48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)


Copy BibTex To Clipboard

@Article{bilyk_et_al:DagRep.9.8.26,
  author =	{Bilyk, Dmitriy and Hinrichs, Aicke and Kuo, Frances Y. and Ritter, Klaus},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 19341)}},
  pages =	{26--48},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{9},
  number =	{8},
  editor =	{Bilyk, Dmitriy and Hinrichs, Aicke and Kuo, Frances Y. and Ritter, Klaus},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.9.8.26},
  URN =		{urn:nbn:de:0030-drops-116835},
  doi =		{10.4230/DagRep.9.8.26},
  annote =	{Keywords: applied harmonic analysis, computational stochastics, computing and complexity in infinite dimensions, discrepancy theory, tractability analysis}
}

Kuo, Frances

Document
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)

Authors: Alexander Keller, Frances Kuo, Andreas Neuenkirch, and Joseph F. Traub

Published in: Dagstuhl Reports, Volume 2, Issue 9 (2013)


Abstract
From 23.09.12 to 28.09.12, the Dagstuhl Seminar 12391 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar can be found in this report. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Alexander Keller, Frances Kuo, Andreas Neuenkirch, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391). In Dagstuhl Reports, Volume 2, Issue 9, pp. 200-225, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)


Copy BibTex To Clipboard

@Article{keller_et_al:DagRep.2.9.200,
  author =	{Keller, Alexander and Kuo, Frances and Neuenkirch, Andreas and Traub, Joseph F.},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)}},
  pages =	{200--225},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{9},
  editor =	{Keller, Alexander and Kuo, Frances and Neuenkirch, Andreas and Traub, Joseph F.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.9.200},
  URN =		{urn:nbn:de:0030-drops-38920},
  doi =		{10.4230/DagRep.2.9.200},
  annote =	{Keywords: Computational complexity of continuous problems, Partial information, Biomedical learning problems, Random media, Computational finance, Noisy data, Tractability, Quantum computation, Computational stochastic processes, High-dimensional problems}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail